A heuristic algorithm for container loading of pallets with infill boxes

نویسندگان

  • Sheng Liu
  • Hongxia Zhao
  • Xisong Dong
  • Changjian Cheng
چکیده

We consider the container loading problem that occurs at many furniture factories where product boxes are arranged on product pallets and the product pallets are arranged in a container for shipments. The volume of products in the container should be maximized, and the bottom of each pallet must be fully supported by the container floor or by the top of a single pallet to simplify the unloading process. To improve the filling rate of the container, the narrow spaces at the tops and sides of the pallets in the container should be filled with product boxes. However, it must be ensured that all of the infill product boxes can be entirely palletized into complete pallets after being shipped to the destination. To solve this problem, we propose a heuristic algorithm consisting of a tree search sub-algorithm and a greedy subalgorithm. The tree search sub-algorithm is employed to arrange the pallets in the container. Then, the greedy sub-algorithm is applied to fill the narrow spaces with product boxes. The computational results on BR1–BR15 show that our algorithm is competitive. © 2016 Elsevier B.V. All rights reserved.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Evolutionary Approach for Optimizing 3D Heterogeneous Bin Packing Problems

This paper presents a combinational Hybrid Genetic Algorithm (HGA) with packing tuning approach for solving Three Dimensional (3D) Single container arbitrary sized heterogeneous bin packing optimization problem, by considering practical constraints in the shipment container loading industries. Aim of this paper is to (i) pack 3D arbitrary sized heterogeneous bins in to a container. (ii) Improve...

متن کامل

Online 2d Arbitrary Sized Bin Packing Optimization Using 2pdc Heuristic: a Genetic Approach

This paper presents a Heuristic Genetic Algorithm (HGA) for optimizing two dimensional (2D) arbitrary sized heterogeneous box packing into a container, by considering practical constraints facing in the shipment container loading industries. Objective of this research is to pack heterogeneous boxes of varying length, width and constant height into a container of standard dimension, without viol...

متن کامل

A heuristic for the container loading problem: A tertiary-tree-based dynamic space decomposition approach

Increasing fuel costs, post-911 security concerns, and economic globalization provide a strong incentive for container carriers to use available container space more efficiently, thereby minimizing the number of container trips and reducing socio-economic vulnerability. A heuristic algorithm based on a tertiary tree model is proposed to handle the container loading problem (CLP) with weakly het...

متن کامل

3d Arbitrary Sized Bin Packing Optimization Using 2pdc Heuristic: A Adaptive Genetic Approach

This paper presents a Heuristic Genetic Algorithm (HGA) for optimizing three dimensional (3D) arbitrary sized heterogeneous boxes into a container, by considering practical constraints facing in the shipment container loading industries. Objective of this research is to pack heterogeneous boxes of varying length, width and height into a container of standard dimension, without violating major p...

متن کامل

A GA-based Heuristic for the Interrelated Container Selection Loading Problems

An integrated heuristic approach based on genetic algorithms (GAs) is proposed for solving the container selection and loading problems. The GA for container selection solves a two-dimensional knapsack problem, determining a set of containers to minimize the transportation or shipment cost. The GA for container loading solves for the weighted coefficients in the evaluation functions that are ap...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • European Journal of Operational Research

دوره 252  شماره 

صفحات  -

تاریخ انتشار 2016